FEW-GROUP CROSS SECTIONS LIBRARY BY ACTIVE LEARNING WITH SPLINE KERNELS

نویسندگان

چکیده

This work deals with the representation of homogenized few-groups cross sections libraries by machine learning. A Reproducing Kernel Hilbert Space (RKHS) is used for different Pool Active Learning strategies to obtain an optimal support. Specifically a spline kernel and results are compared multi-linear interpolation as in industry, discussing reduction library size overall performance. standard PWR fuel assembly provides use case (OECD-NEA Burn-up Credit Criticality Benchmark [1]).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite p-groups with few non-linear irreducible character kernels

Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

متن کامل

SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels

We present Spline-based Convolutional Neural Networks (SplineCNNs), a variant of deep neural networks for irregular structured and geometric input, e.g., graphs or meshes. Our main contribution is a novel convolution operator based on B-splines, that makes the computation time independent from the kernel size due to the local support property of the B-spline basis functions. As a result, we obt...

متن کامل

Probabilistic Active Learning with Structure-Sensitive Kernels

This work proposes two approaches to improve the poolbased active learning strategy ’Multi-Class Probabilistic Active Learning ’ (McPAL) by using two kernel functions based on Gaussian mixture models (GMMs). One uses the kernels for the instance selection of the McPAL strategy, the second employs them in the classification step. The results of the evaluation show that using a different classifi...

متن کامل

Learning with Cross-Kernels and Ideal PCA

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of ‘feature spanning points’ can be used for learning. The main potential of cross-kernels lies in the fact that (a) only one side of the matrix scales with the number of data points, and (b) cross-kernels, as opposed to the usual kernel matrices, can be used to certify for the data manifold...

متن کامل

B-Spline Surface Approximation to Cross-Sections Using Distance Maps

The shape reconstruction of a 3D object from its 2D crosssections is important for reproducing it by NC machining or rapid prototyping. In this paper, we present a method of surface approximation to cross-sections with multiple branching problems. In this method, we first decompose each multiple branching problem into a set of single branching problems by providing a set of intermediate contour...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Epj Web of Conferences

سال: 2021

ISSN: ['2101-6275', '2100-014X']

DOI: https://doi.org/10.1051/epjconf/202124706012